Embedding Spanning Trees in Random Graphs
نویسنده
چکیده
We prove that if T is a tree on n vertices with maximum degree ∆ and the edge probability p(n) satisfies: np ≥ C max{∆ log n, n } for some constant > 0, then with high probability the random graph G(n, p) contains a copy of T . The obtained bound on the edge probability is shown to be essentially tight for ∆ = n.
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملLarge Bounded Degree Trees in Expanding Graphs
A remarkable result of Friedman and Pippenger [4] gives a sufficient condition on the expansion properties of a graph to contain all small trees with bounded maximum degree. Haxell [5] showed that under slightly stronger assumptions on the expansion rate, their technique allows one to find arbitrarily large trees with bounded maximum degree. Using a slightly weaker version of Haxell’s result we...
متن کاملLocal resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically almost surely contains a copy of every tree with maximum degree at most D and at most (1− α)n vertices, even after we delete a (1/2− γ)-fraction of the edges incident to each vertex. The proof uses Szemerédi’s regularity lem...
متن کاملSpanning Trees of Small Degree
In this paper we show that pseudo-random graphs contain spanning trees of maximum degree 3. More specifically, (n, d, λ)-graphs with sufficiently large spectral gap contain such spanning trees.
متن کاملLocal Convergence of Graphs and Enumeration of Spanning Trees
A spanning tree in a connected graph G is a subgraph that contains every vertex of G and is itself a tree. Clearly, if G is a tree then it has only one spanning tree. Every connected graph contains at least one spanning tree: iteratively remove an edge from any cycle that is present until the graph contains no cycles. Counting spanning trees is a very natural problem. Following Lyons [5] we wil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 24 شماره
صفحات -
تاریخ انتشار 2010